Graph matching for object recognition and recovery
نویسندگان
چکیده
A robust skeleton-based graph matching method for object recognition and recovery applications is presented. The object model uses both a skeleton model and contour segment models, for object recognition and recovery. Initially, the skeleton representation is created from the input contour that is provided by a deformable contour method (DCM). The skeleton is then matched against a set of object skeleton models to select a candidate model. Corresponding feature points or landmarks on the input and model contours are determined from their skeletons automatically. Based on the landmarks, the input and model contours are broken into contour segments. The input contour segments are then matched against the corresponding model segments for error analysis. For any large error in the segment mismatch, a fine-tuning process is performed to enhance the final segmentation result. The skeleton-based shape matching algorithm is illustrated by using a set of animal silhouette examples. Experiments of object recovery using real biomedical image samples, such as MRI knee and brain’s corpus callosum images, have shown satisfac-
منابع مشابه
Many-to-many feature matching in object recognition: a review of three approaches
The mainstream object categorisation community relies heavily on object representations consisting of local image features, due to their ease of recovery and their attractive invariance properties. Object categorisation is therefore formulated as finding, that is, ‘detecting’, a one-to-one correspondence between image and model features. This assumption breaks down for categories in which two e...
متن کاملMany-to-Many Feature Matching in Object Recognition
One of the bottlenecks of current recognition (and graph matching) systems is their assumption of one-to-one feature (node) correspondence. This assumption breaks down in the generic object recognition task where, for example, a collection of features at one scale (in one image) may correspond to a single feature at a coarser scale (in the second image). Generic object recognition therefore req...
متن کاملObject recognition by symmetrised graph matching using relaxation labelling with an inhibitory mechanism
Object recognition using graph-matching techniques can be viewed as a two-stage process: extracting suitable object primitives from an image and corresponding models, and matching graphs constructed from these two sets of object primitives. In this paper we concentrate mainly on the latter issue of graph matching, for which we derive a technique based on probabilistic relaxation graph labelling...
متن کاملRulegraphs for Pattern Recognition
We present and compare two new techniques for Learning Relational Structures (RS) as they occur in 2D pattern and 3D object recognition. The two techniques, Evidence-Based Systems (EBS) and Rulegraphs (RG) combine techniques from Computer Vision with those from Machine Learning, Uncertainty Theory, and Graph Matching. EBS have the ability to generalize pattern rules from training instances in t...
متن کاملIFMBE Proceedings Series– Instructions for Authors
We present an approach to the detection of anatomical landmarks in CT data sets. Our first application is detection of vertebrae and landmarks on vertebrae in 2D slices. The core technique is a feature driven matching of a graph created from one or more vertebrae with unseen data. This is based on an approach that has been successfully applied to face recognition in the past. Keywords— Anatomic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Pattern Recognition
دوره 37 شماره
صفحات -
تاریخ انتشار 2004